Parallelized Optimization of LDPC Decoding Algorithms

نویسندگان

  • Michael Lunglmayr
  • Jens Berkmann
  • Mario Huemer
چکیده

One of the major problems in communications engineering is to efficiently recover errors of transmitted data blocks by forward error correction (FEC). Low Density Parity Check (LDPC) codes are very popular for FEC. They are known to be one of the best coding schemes in terms of error correction performance. Because the decoding of practically used LDPC codes is NP-hard, only suboptimal algorithms can be applied. To optimize decoding algorithms in terms of decoding performance, a high amount of numerical simulations is needed. We present a parallelized method for evaluating and optimizing the performance of LDPC decoding algorithms. Using performance criteria of the decoding algorithms, the optimization is done by applying nonlinear optimization methods to select algorithm parameters.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Density evolution for BP-based decoding algorithms of LDPC codes and their quantized versions

Quantized Versions Jinghu Chen and Marc P.C. Fossorier Department of Electrical Engineering, University of Hawaii, Honolulu, HI 96822, USA e-mail:jinghu,[email protected] AbstractIn this paper, we analyze the performance of two improved BP-based decoding algorithms for LDPC codes, namely the normalized BP-based and the offset BP-based algorithms, by means of density evolution. The num...

متن کامل

Comparison of Simplified Gradient Descent Algorithms for Decoding Ldpc Codes

In this paper it is shown that multi GDBF algorithm exhibits much faster convergence as compared to the single GDBF algorithm. The multi GDBF algorithm require less iterations when compared to the single GDBF algorithm for the search point to closely approach the local maximum point taking into consideration the gradient descent bit flipping (GDBF) algorithms exhibiting better decoding performa...

متن کامل

Optimization-Based Decoding Algorithms for LDPC Convolutional Codes in Communication Systems

In a digital communication system, information is sent from one place to another over a noisy communication channel. It may be possible to detect and correct errors that occur during the transmission if one encodes the original information by adding redundant bits. Low-density parity-check (LDPC) convolutional codes, a member of the LDPC code family, encode the original information to improve e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008